Descartes Systems from Corner Cutting
نویسندگان
چکیده
Here cI . . . . . c~ are vectors (control points) in some s-dimensional linear space, say W. The control polygon is then determined by the composite vector c r R "~ and we can think of c geometrically as a polygonal line. Various algorithms for the manipulation and computation of such curves take the form of successive geometric alterations of the control polygon. In particular, in the case of the Bernstein bases
منابع مشابه
Corner cutting systems
If we can evaluate a curve by means of a corner cutting algorithm, we call the corresponding system of functions a corner cutting system. We prove that corner cutting systems are always monotonicity preserving. We obtain weak sufficient conditions for corner cutting systems. Optimal stability properties and properties concerning the supports of the basis functions of corner cutting systems are ...
متن کاملCorner Polyhedra and Maximal Lattice-free Convex Sets : A Geometric Approach to Cutting Plane Theory
Corner Polyhedra were introduced by Gomory in the early 60s and were studied by Gomory and Johnson. The importance of the corner polyhedron is underscored by the fact that almost all “generic” cutting planes, both in the theoretical literature as well as ones used in practice, are valid for the corner polyhedron. So the corner polyhedron can be viewed as a unifying structure from which many of ...
متن کاملA New Corner cutting Scheme with tension and Handle-Face Reconstruction
A recently developed topological mesh modeling approach allows users to change topology of orientable 2-manifold meshes and to create unusual faces. Handle-faces are one of such faces that are commonly created during topology changes. This paper shows that vertex insertion and corner cutting subdivision schemes can effectively be used to reconstruct handle-faces. These reconstructions effective...
متن کاملOn the degree elevation of B-spline curves and corner cutting
In this paper we prove that the degree elevation of B-spline curves can be interpreted as corner cutting process in theory. We also discover the geometric meaning of the auxiliary control points during the corner cutting. Our main idea is to gradually elevate the degree of B-spline curves one knot interval by one knot interval. To this end, a new class of basis functions, to be called bi-degree...
متن کاملHandle and Hole Improvement by Using New Corner Cutting Subdivision Scheme with Tension
The recently developed Doubly Linked Face List (DLFL) structure introduces a powerful modeling paradigm that allows users to alternatively apply topological change operations and subdivision operations on mesh structure. Moreover, the DLFL is topologically robust in the sense that it always guarantees valid 2-manifold surfaces. In this paper, we further study the relationship between DLFL struc...
متن کامل